The capacity of the arbitrarily varying channel revisited: positivity, constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The capacity of the arbitrarily varying channel revisited: Positivity, constraints

A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitrarily varying channel (AVC), under the average error probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternatives, namely, the capacity is zero if and only if the AVC is symmetrizable. The capacity ...

متن کامل

Capacity of the Gaussian arbitrarily varying channel

The Gaussian arbitrarily varying channel with input constraint r and state constraint 2 admits input sequences x = ( x l , , x , ~ ) of real numbers with Cxf 5 nT and state sequences s = ( 5 ,. , T , ~ ) of real numbers with L Y ~ 5 H A ; the output sequence x + s + V , where V = ( VI, , y , ) is a sequence of independent and identically distributed Gaussian random variables with mean 0 and var...

متن کامل

Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints

Abstruct-The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.

متن کامل

The capacity of a vector Gaussian arbitrarily varying channel

The random coding capacity of a vector Gaussian arbitrarily varying channel (VGAVC) is determined, along with a simple general method for computing this capacity. The VGAVC is a discrete-time memoryless vector channel with an input power constraint and additive Gaussian noise that is further corrupted by an additive “jamming signal.” The statistics of this jamming signal are unknown and may be ...

متن کامل

The Arbitrarily Varying Relay Channel

We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 1988

ISSN: 0018-9448

DOI: 10.1109/18.2627